C. Wulff-Nilsen: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

1

Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time

Wulff-Nilsen, Christian

Journal:

Computational Geometry

Year:

2013

Language:

english

File:

PDF, 183 KB

english, 2013

2

Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time

Borradaile, Glencora, Sankowski, Piotr, Wulff-Nilsen, Christian

Journal:

ACM Transactions on Algorithms

Year:

2015

Language:

english

File:

PDF, 645 KB

english, 2015

3

A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees

M. Brazil, D.A. Thomas, B.K. Nielsen, P. Winter, C. Wulff-Nilsen, M. Zachariasen

Journal:

Year:

2009

Language:

english

File:

PDF, 146 KB

english, 2009

4

Steiner hull algorithm for the uniform orientation metrics

Christian Wulff-Nilsen

Journal:

Computational Geometry

Year:

2008

Language:

english

File:

PDF, 306 KB

english, 2008

5

Computing the dilation of edge-augmented graphs in metric spaces

Christian Wulff-Nilsen

Journal:

Computational Geometry

Year:

2010

Language:

english

File:

PDF, 152 KB

english, 2010

6

[IEEE 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA (2017.10.15-2017.10.17)] 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) - Fast and Compact Exact Distance Oracle for Planar Graphs

Cohen-Addad, Vincent, Dahlgaard, Soren, Wulff-Nilsen, Christian

Year:

2017

Language:

english

File:

PDF, 317 KB

english, 2017

7

[ACM Press the 43rd annual ACM symposium - San Jose, California, USA (2011.06.06-2011.06.08)] Proceedings of the 43rd annual ACM symposium on Theory of computing - STOC '11 - Improved algorithms for min cut and max flow in undirected planar graphs

Italiano, Giuseppe F., Nussbaum, Yahav, Sankowski, Piotr, Wulff-Nilsen, Christian

Year:

2011

Language:

english

File:

PDF, 573 KB

english, 2011

8

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications

Wulff-Nilsen, Christian

Year:

2011

Language:

english

File:

PDF, 536 KB

english, 2011

9

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Single Source -- All Sinks Max Flows in Planar Digraphs

Lacki, Jakub, Nussbaum, Yahav, Sankowski, Piotr, Wulff-Nilsen, Christian

Year:

2012

Language:

english

File:

PDF, 288 KB

english, 2012

10

Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

Borradaile, Glencora, Klein, Philip N., Mozes, Shay, Nussbaum, Yahav, Wulff-Nilsen, Christian

Journal:

SIAM Journal on Computing

Year:

2017

Language:

english

File:

PDF, 454 KB

english, 2017

11

Space-efficient path-reporting approximate distance oracles

Elkin, Michael, Neiman, Ofer, Wulff-Nilsen, Christian

Journal:

Theoretical Computer Science

Year:

2016

Language:

english

File:

PDF, 394 KB

english, 2016

12

[IEEE 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA (2017.10.15-2017.10.17)] 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) - Minor-Free Graphs Have Light Spanners

Borradaile, Glencora, Le, Hung, Wulff-Nilsen, Christian

Year:

2017

Language:

english

File:

PDF, 379 KB

english, 2017

13

Bounding the expected number of rectilinear full Steiner trees

Christian Wulff-Nilsen

Journal:

Year:

2010

Language:

english

File:

PDF, 266 KB

english, 2010

14

[IEEE 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS) - Palm Springs, CA, USA (2011.10.22-2011.10.25)] 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science - Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time

Borradaile, Glencora, Klein, Philip N., Mozes, Shay, Nussbaum, Yahav, Wulff-Nilsen, Christian

Year:

2011

Language:

english

File:

PDF, 684 KB

english, 2011

15

COMPUTING THE STRETCH FACTOR AND MAXIMUM DETOUR OF PATHS, TREES, AND CYCLES IN THE NORMED SPACE

WULFF-NILSEN, CHRISTIAN, GRÜNE, ANSGAR, KLEIN, ROLF, LANGETEPE, ELMAR, LEE, D. T., LIN, TIEN-CHING, POON, SHEUNG-HUNG, YU, TENG-KAI

Journal:

International Journal of Computational Geometry & Applications

Year:

2012

Language:

english

File:

PDF, 348 KB

english, 2012

16

Near-Optimal Light Spanners

Chechik, Shiri, Wulff-Nilsen, Christian

Journal:

ACM Transactions on Algorithms

Year:

2018

Language:

english

File:

PDF, 369 KB

english, 2018

17

[IEEE 2010 IEEE 51st Annual Symposium on Foundations of Computer Science (FOCS) - Las Vegas, NV, USA (2010.10.23-2010.10.26)] 2010 IEEE 51st Annual Symposium on Foundations of Computer Science - Min st-cut Oracle for Planar Graphs with Near-Linear Preprocessing Time

Borradaile, Glencor, Sankowski, Piotr, Wulff-Nilsen, Christian

Year:

2010

Language:

english

File:

PDF, 2.51 MB

english, 2010

18

[IEEE 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA (2017.10.15-2017.10.17)] 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) - Dynamic Minimum Spanning Forest with Subpolynomial Worst-Case Update Time

Nanongkai, Danupon, Saranurak, Thatchaphol, Wulff-Nilsen, Christian

Year:

2017

Language:

english

File:

PDF, 295 KB

english, 2017

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@1delivery.pm

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски